Cryptanalysis of Grigoriev-Shpilrain Physical Asymmetric Scheme With Capacitors
نویسنده
چکیده
Few days ago Grigoriev and Shpilrain have proposed to build a system for transmission of information without a shared secret, or essentially a sort of public key cryptosystem, based on properties of physical systems [2]. In this paper we show that their second scheme based on capacitors is insecure and extremely easy to break in practice.
منابع مشابه
Cryptanalysis and Improvements on Some Graph-based Authentication Schemes
In 2010, Grigoriev and Shpilrain, introduced some graph-based authentication schemes. We present a cryptanalysis of some of these protocols, and introduce some new schemes to fix the problems.
متن کاملTropical Cryptography Dima Grigoriev and Vladimir Shpilrain
We employ tropical algebras as platforms for several cryptographic schemes that would be vulnerable to linear algebra attacks were they based on “usual” algebras as platforms.
متن کاملAuthentication from matrix conjugation
We propose an authentication scheme where forgery (a.k.a. impersonation) seems infeasible without finding the prover’s long-term private key. The latter is equivalent to solving the conjugacy search problem in the platform (noncommutative) semigroup, i.e., to recovering X from X−1AX and A. The platform semigroup that we suggest here is the semigroup of n×n matrices over truncated multivariable ...
متن کاملCryptanalysis of Stickel's Key Exchange Scheme
We offer cryptanalysis of a key exchange scheme due to Stickel [11], which was inspired by the well-known Diffie-Hellman protocol. We show that Stickel’s choice of platform (the group of invertible matrices over a finite field) makes the scheme vulnerable to linear algebra attacks with very high success rate in recovering the shared secret key (100% in our experiments). We also show that obtain...
متن کاملCryptanalysis of an Authentication Scheme Using Truncated Polynomials
An attack on a recently proposed authentication scheme of Shpilrain and Ushakov is presented. The public information allows the derivation of a system of polynomial equations for the secret key bits. Our attack uses simple elimination techniques to distill linear equations. For the proposed parameter choice, the attack often finds secret keys or alternative secret keys within minutes with moder...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- IACR Cryptology ePrint Archive
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013